Harnessing Diversity towards the Reconstructing of Large Scale Gene Regulatory Networks
نویسندگان
چکیده
Elucidating gene regulatory network (GRN) from large scale experimental data remains a central challenge in systems biology. Recently, numerous techniques, particularly consensus driven approaches combining different algorithms, have become a potentially promising strategy to infer accurate GRNs. Here, we develop a novel consensus inference algorithm, TopkNet that can integrate multiple algorithms to infer GRNs. Comprehensive performance benchmarking on a cloud computing framework demonstrated that (i) a simple strategy to combine many algorithms does not always lead to performance improvement compared to the cost of consensus and (ii) TopkNet integrating only high-performance algorithms provide significant performance improvement compared to the best individual algorithms and community prediction. These results suggest that a priori determination of high-performance algorithms is a key to reconstruct an unknown regulatory network. Similarity among gene-expression datasets can be useful to determine potential optimal algorithms for reconstruction of unknown regulatory networks, i.e., if expression-data associated with known regulatory network is similar to that with unknown regulatory network, optimal algorithms determined for the known regulatory network can be repurposed to infer the unknown regulatory network. Based on this observation, we developed a quantitative measure of similarity among gene-expression datasets and demonstrated that, if similarity between the two expression datasets is high, TopkNet integrating algorithms that are optimal for known dataset perform well on the unknown dataset. The consensus framework, TopkNet, together with the similarity measure proposed in this study provides a powerful strategy towards harnessing the wisdom of the crowds in reconstruction of unknown regulatory networks.
منابع مشابه
Inferring large-scale gene regulatory networks using a low-order constraint-based algorithm.
Recently, simplified graphical modeling approaches based on low-order conditional (in-)dependence calculations have received attention because of their potential to model gene regulatory networks. Such methods are able to reconstruct large-scale gene networks with a small number of experimental measurements, at minimal computational cost. However, unlike Bayesian networks, current low-order gra...
متن کاملH∞ Sampled-Data Controller Design for Stochastic Genetic Regulatory Networks
Artificially regulating gene expression is an important step in developing new treatment for system-level disease such as cancer. In this paper, we propose a method to regulate gene expression based on sampled-data measurements of gene products concentrations. Inherent noisy behaviour of Gene regulatory networks are modeled with stochastic nonlinear differential equation. To synthesize feed...
متن کاملA Bayesian Model Framework for Reconstructing Gene Network
Gene regulatory networks provide the systematic view of molecular interactions in a complex living system. Reconstructing large-scale gene regulatory networks is challenging problems in systems biology. For reliable gene regulatory network reconstruction from large burst sets of biological data require a proper integration technique. In this paper, we are employing Recurrent Neural Network (RNN...
متن کاملA Computational Approach to Reconstructing Gene Regulatory Networks
With the rapid accumulation of gene expression data in publicly accessible databases, computational study of gene regulation has become an obtainable goal. Intrinsic to this task will be data mining tools for inferring knowledge from biological data. In this project, we have developed a new data mining technique in which we adapt the connectivity of a recurrent neural network model by indexing ...
متن کاملReconstructing Pathways in Large Genetic Networks from Genetic Perturbations
I present an algorithm that determines the longest path between every gene pair in an arbitrarily large genetic network from large scale gene perturbation data. The algorithm's computational complexity is O(nk(2)), where n is the number of genes in the network and k is the average number of genes affected by a genetic perturbation. The algorithm is able to distinguish a large fraction of direct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 9 شماره
صفحات -
تاریخ انتشار 2013